Eulerian disjoint paths problem in grid graphs is NP-complete
نویسنده
چکیده
We show that the edge disjoint paths problem is NP-complete in directed or undirected rectangular grids, even if the union G + H of the supply and the demand graph is Eulerian.
منابع مشابه
Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
Given a graph and pairs siti of terminals, the edge-disjoint paths problem is to determine whether there exist siti paths that do not share any edges. We consider this problem on acyclic digraphs. It is known to be NP-complete and solvable in time n where k is the number of paths. It has been a long-standing open question whether it is fixed-parameter tractable in k. We resolve this question in...
متن کاملMaximum Edge Disjoint Paths and Minimum Unweighted Multicuts in Grid Graphs
In this paper, we solve in polynomial time the maximum edge disjoint paths problem and the related minimum unweighted multicut problem in grid graphs. Let G = (V,E) be an undirected rectilinear grid and let L be a list of K pairs (source sk, sink tk) of terminal vertices of G. Each pair (sk, tk) defines a net. We assume that sources are on the upper horizontal line, sinks are on the lower horiz...
متن کاملOn s-t paths and trails in edge-colored graphs
In this paper we deal from an algorithmic perspective with different questions regarding monochromatic and properly edge-colored s-t paths/trails on edge-colored graphs. Given a c-edge-colored graph Gc without properly edge-colored closed trails, we present a polynomial time procedure for the determination of properly edgecolored s-t trails visiting all vertices of Gc a prescribed number of tim...
متن کاملHamiltonian Cycles in Linear-Convex Supergrid Graphs
A supergrid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional supergrid. The supergrid graphs contain grid graphs and triangular grid graphs as subgraphs. The Hamiltonian cycle problem for grid and triangular grid graphs was known to be NP-complete. In the past, we have shown that the Hamiltonian cycle problem for supergrid graphs is also NP-complete. ...
متن کاملA note on packing paths in planar graphs
P.D. Seymour proved that the cut criterion is necessary and suucient for the solvability of the edge-disjoint paths problem when the union of the supply graph and the demand graph is planar and Eulerian. When only planarity is required, M. Middendorf and F. Pfeiier proved the problem to be NP-complete. For this case E. Korach and M. Penn proved that the cut criterion is suucient for the existen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 143 شماره
صفحات -
تاریخ انتشار 2004